An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS

نویسندگان

  • Thomas Weik
  • Andreas Heuer
چکیده

In this paper we describe an algorithm for the analysis of termination of a large set of triggers in an OODBMS. It is quite clear that, if the trigger mechanism is of suucient complexity, the problem is undecidable. Yet, by the extensive use of object-oriented concepts, like derived classes, and lattice theory, we are able to give some suucient conditions for termination which yield satisfying results. Another advantage of our approach is the uniform treatment of generic update operations on the one hand, and methods and abstract data types on the other. Our algorithms are meant to be incorporated into a design tool which shows the rule designer connicting subsets of rules. Then the designer can prove that the rules don't pose a problem for himself, or he can remodel his rules to remove the connict.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering

Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

Diagnosis of the disease using an ant colony gene selection method based on information gain ratio using fuzzy rough sets

With the advancement of metagenome data mining science has become focused on microarrays. Microarrays are datasets with a large number of genes that are usually irrelevant to the output class; hence, the process of gene selection or feature selection is essential. So, it follows that you can remove redundant genes and increase the speed and accuracy of classification. After applying the gene se...

متن کامل

Optimization of thermal curing cycle for a large epoxy model

Heat generation in an exothermic reaction during the curing process and low thermal conductivity of the epoxy resin produces high peak temperature and temperature gradients which result in internal and residual stresses, especially in large epoxy samples. In this paper, an optimization algorithm was developed and applied to predict the thermal cure cycle to minimize the temperature peak and the...

متن کامل

Application of Recursive Least Squares to Efficient Blunder Detection in Linear Models

In many geodetic applications a large number of observations are being measured to estimate the unknown parameters. The unbiasedness property of the estimated parameters is only ensured if there is no bias (e.g. systematic effect) or falsifying observations, which are also known as outliers. One of the most important steps towards obtaining a coherent analysis for the parameter estimation is th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995